搜索资源列表
hufmtree
- 数据结构上机实验——哈弗曼树。可实现根据节点大小建立哈弗曼树并对其进行编码,根据自定义输入编码进行解码。简明、易懂、C++自编版。-Data structure on experiments- Ha Fuman tree. Can be realized according to the size of the establishment of Ha Fuman tree node and encode, according to the custom input encoding to dec
zuxian
- 设计一个算法,对于给定的二叉树中2结点返回它们的最近公共祖先。-Design an algorithm for a given binary tree node 2 back to their most recent common ancestor.
TREE-CONTORL
- 本例将实现以下功能: (1)建立一个以国家、城市、城区三层的Tree Control对象(固定数据); (2)当双击某个节点时,在文本框显示点的节点的KEY值和节点文本值。-This example will achieve the following functions: (1) the establishment of a country, city, urban three-storey Tree Control object (fixed data) (2) Double-cl
userTreeView2005
- 菜单采用TreeView+Sql数据库动态控制,可以进行权限及用户的管理操作,用户登录采用验证码进行校验,公用部分采用用户控件 树的操作说明如下: (1):单击【添加】按钮添加表结点,和结点相关联的表及其描述不能为空; (2):单击【添加树菜单】按钮添加菜单结点,其不关联任何表,但描述不能为空; (3):双击树结点,然后单击【修改】按钮可以修改选择的结点; (4):单击【删除】按钮可以删除择的结点; (5):单击【上移】或【下移】按钮可以排列选择结点显示
Binary-tree-traversal-algorithm
- 二叉树的遍历有常用的三种方法,分别是:先根次序、中根次序、后根次序。为了验证这几种遍历算法的区别,本次的实验将会实现所有的算法。 遍历的时候,把结点的信息打印出来,为了让结点的信息更容易区别,在每个结点前加上数字标识。如:data[1]=A,data[2]=B. 实现的算法皆为递归算法 -Binary tree traversal has used three methods, namely: first, the root sequence, the order of the ro
binary-tree
- 返回二叉树的根+返回树中某个结点的左孩子,若无则返回空+返回树中某个结点的双亲,如果是根结点,则返回空-Returns the binary tree root+ returns tree in a node of the left child, if there is no return null+ returns tree in a node s parents, if the root node, it returns null
erchashu
- 这是一个二叉树程序,实现二叉树求结点的功能-This is a binary tree program, seeking to achieve a binary tree node function
erchashu
- 实现用二叉树求两节点最近祖先的功能,方便实用-Seeking to achieve with a binary tree node recent ancestor of two functions, convenient and practical
DepartmentTreeView
- WPF TreeView递归异步绑定.WPF的TreeView不像WinForms的TreeView那样,通过TreeNode实现树型节点。WPF的TreeView实现起来,我感觉有点像VM(View-Model)模式,就像WinForms中的DataGrid,控件负责显示,数据在DataTable中。那么我们在实现TreeView时,也需要用这样的思路,数据在Model中,控件是View负责显示。-Recursive Asynchronous Binding WPF TreeView.WPF
houxu
- 数据结构里,后序线索二叉树中查找已知结点的后序前趋。-Data structure, the order of clues to find the binary tree node is known before the trend of the order.
tree
- 1.可让用户选择你的测试例子,也可由用户随意输入待计算的表达式。 2.每单击一次就扩展一个结点。 3.能够显示计算过程。 即在界面中应用相应的按钮,每单击一次就计算一次。 -1. Allows the user to select your test case, the user may also be free to enter an expression to be calculated 2. Each click on the expansion of a no
index-tree
- 排序二叉树的改进,在每个节点上加一个值来统计该节点左边的结点个数,方便插入、删除和查找-Binary sort tree improvement, at each node with a value to the statistics of the node on the left side of the node number, convenient to insert, delete and search
N-binary-tree-to-traverse
- 本程序用递归法遍历N叉树。可进行深度和广度遍历。 注: 按“/”键结束输入 如 2 1 3 / 6 / 9 / / / / 输入可得 深度遍历为21369,广度遍历为21369 最打节点个数为100个,且节点类型为字符型-This program using a recursive method to traverse N binary tree. For depth and the breadth traverse.
Huffman-tree
- 利用静态链表建立赫夫曼树,建树过程中左子树权值小于右子树权值,求各结点的编码。叶子结点的个数n及结点值由键盘录入-Using static linked list to establish a Huffman tree, set during the process of weight less than the right subtree subtree weights, and each node coding. Leaf node of the number N and node valu
MFCTree
- MFC树型控件的操作过程,包括在MFC对话框中使用程序的方法添加树型控制的详细过程。此程序使用VS2010开发,界面中可以添加树形节点,修改并删除树型控件中的节点项。-MFC tree control operation, including the procedures used in the MFC dialog box to add the tree control process. This program uses the VS2010 development, can add a t
node
- java模拟二叉树的算法,不错哦,来下载吧-java simulation of the binary tree algorithm, Oh, to download
Binary-tree-traversal
- 二叉树遍历:构建一个二叉树,输出结点信息,二叉树前序遍历,中序遍历,后续遍历,层次遍历。-Binary Tree Traversal: build a binary tree, the output node information before, binary tree traversal in preorder traversal, the follow-up traverse the hierarchy traversal.
data-struct
- 一些数据结构算法集合:普通链表结点、双向循环链表结点、二叉树结点、 树结点、双向循环链表、哈希表、二叉搜索树等。-A collection of some data structure algorithms: ordinary linked list of nodes, two-way circular linked list of nodes, the binary tree node, tree node, two-way circular linked lists, hash tables
treeview2xml
- 将树的节点保存到XML文件中,在程序加载时由重XML文件中读取出来,达到Tree和XML的相互转化。-The Tree node saved to the XML documents, in the program when loading by heavy XML documents read out to the Tree and XML conversion.
tree
- 二叉树是每个节点最多有两个子树的有序树二叉树是每个节点最多有两个子树的有序树-A binary tree is most each node has two clauses of the orderly tree treeA binary tree is most each node has two clauses of the orderly tree tree